Перевод: со всех языков на русский

с русского на все языки

deterministic sequence

См. также в других словарях:

  • Deterministic finite-state machine — An example of a Deterministic Finite Automaton that accepts only binary numbers that are multiples of 3. The state S0 is both the start state and an accept state. In the theory of computation and automata theory, a deterministic finite state… …   Wikipedia

  • Deterministic algorithm — In computer science, a deterministic algorithm is an algorithm which, in informal terms, behaves predictably. Given a particular input, it will always produce the same output, and the underlying machine will always pass through the same sequence… …   Wikipedia

  • Deterministic policy — In AI planning and reinforcement learning, a policy prescribes an action given a non empty sequence of states. A deterministic policy will always prescribe the same action, over time,for any given input …   Wikipedia

  • Halton sequence — In statistics, Halton sequences are sequences used to generate points in space for numerical methods such as Monte Carlo simulations. Although these sequences are deterministic they are of low discrepancy, that is, appear to be random for many… …   Wikipedia

  • Pseudorandom binary sequence — A binary sequence (BS) is a sequence of N bits, :a j for j=0,1,...,N 1, i.e. m ones and N m zeros. A BS is pseudo random (PRBS) if its autocorrelation function :C(v)=sum {j=0}^{N 1} a ja {j+v}has only two values::C(v)=egin{cases}m, mbox{ if }… …   Wikipedia

  • Automatic sequence — An automatic sequence is an infinite word characterized by a finite automaton. There are two equivalent definitions.Automaton point of viewLet q be an integer, and A =( E ,φ, e ) be a deterministic automaton where * E is the finite set of states… …   Wikipedia

  • Pseudorandom noise — In cryptography, pseudorandom noise (PRN[1][2]) is a signal similar to noise which satisfies one or more of the standard tests for statistical randomness. Although it seems to lack any definite pattern, pseudorandom noise consists of a… …   Wikipedia

  • Continuous mapping theorem — In probability theory, the continuous mapping theorem states that continuous functions are limit preserving even if their arguments are sequences of random variables. A continuous function, in Heine’s definition, is such a function that maps… …   Wikipedia

  • McNaughton's Theorem — In automata theory, McNaughton s theorem refers to a theorem that asserts that the set of ω regular languages is identical to the set of languages recognizable by deterministic Muller automata. [1] This theorem is proven by supplying an algorithm …   Wikipedia

  • Pseudorandom number generator — A pseudorandom number generator (PRNG), also known as a deterministic random bit generator (DRBG),[1] is an algorithm for generating a sequence of numbers that approximates the properties of random numbers. The sequence is not truly random in… …   Wikipedia

  • Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
… Нажмите правой клавишей мыши и выберите «Копировать ссылку»